Computational Models Based on Synchronized Oscillators for Solving Combinatorial Optimization Problems
نویسندگان
چکیده
The equivalence between the natural minimization of energy in a dynamic system and an objective function characterizing combinatorial optimization problem offers promising approach to design dynamic-system-inspired computational models solvers for such problems. For instance, ground-state coupled electronic oscillators, under second-harmonic injection, can be directly mapped optimal solution maximum-cut problem. However, prior work has focused on limited set Therefore, this work, we formulate computing based synchronized oscillator dynamics broad spectrum problems ranging from Max-K-Cut (the general version problem) traveling-salesman We show that engineered solve these different by appropriately designing coupling external injection oscillators. Our marks step forward towards expanding functionalities oscillator-based analog accelerators furthers scope
منابع مشابه
On Solving Combinatorial Optimization Problems
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...
متن کاملA Dual-based Combinatorial Algorithm for Solving Cyclic Optimization Problems
This paper describes Patent Number U.S. 8,046,316 B2, titled “Cyclic Combinatorial Method and System”, issued by the US Patents and Trademarks Office on October 25, 2011. The patent is based on a combinatorial algorithm to solve cyclic optimization problems. First, the algorithm identifies cyclically distinct solutions of such problems by enumerating cyclically distinct combinations of the basi...
متن کاملSolving Optimization Problems on Computational Grids
Multiprocessor computing platforms, which have become available more and more widely since the mid-1980s, are now heavily used by organizations that need to solve very demanding computational problems. There has also been a great deal of research on computational techniques that are suited to these platforms, and on the software infrastructure needed to compile and run programs on them. Paralle...
متن کاملA FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS
Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...
متن کاملSolving Combinatorial Optimization Problems using Distributed Approach
Combinatorial optimization is a way of finding an optimum solution from a finite set of objects. For combinatorial optimization problems, the number of possible solutions grows exponentially with the number of objects. These problems belong to the class of NP hard problems for which probably efficient algorithm does not exist. Using the distributed approach with parallelization these problems c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review applied
سال: 2022
ISSN: ['2331-7043', '2331-7019']
DOI: https://doi.org/10.1103/physrevapplied.17.064064